Partitioning mathematical programs for parallel solution
نویسندگان
چکیده
This paper describes heuristics for partitioning a general M x N matrix into arrowhead form. Such heuristics are useful for decomposing large, constrained, optimization problems into forms that are amenable to parallel processing. The heuristics presented can be easily implemented using publicly available graph partitioning algorithms. The application of such techniques for solving large linear programs is described. Extensive computational results on the effectiveness of our partitioning procedures and their usefulness for parallel optimization are presented. @ 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
منابع مشابه
Modularity-Maximizing Graph Communities via Mathematical Programming
In many networks, it is of great interest to identify communities, unusually densely knit groups of individuals. Such communities often shed light on the function of the networks or underlying properties of the individuals. Recently, Newman suggested modularity as a natural measure of the quality of a network partitioning into communities. Since then, various algorithms have been proposed for (...
متن کاملAn Effective Model to Decompose Linear Programs for Parallel Solution
Although inherent parallelism in the solution of block angular Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular form for parallel solution is very rare and recent. We have previously proposed hypergraph models, which reduced the problem to the hypergraph partitioning problem. However, the...
متن کاملMulti - Level Cooperative Search : A NewParadigm for Combinatorial Optimization
Cooperative search is a parallelization strategy for search algorithms where parallelism is obtained by concurrently executing several search programs. The solution space is implicitly decomposed according to the search strategy of each program. The programs cooperate by exchanging information on previously explored regions of the solution space. In this paper we propose a new design for cooper...
متن کاملOne-dimensional partitioning for heterogeneous systems: Theory and practice
Westudy the problemof one-dimensional partitioning of nonuniformworkload arrays,with optimal load balancing for heterogeneous systems.We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning,where processor permutation is allowed.Wepresent polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while...
متن کاملPartitioning and Scheduling to Counteract Overhead
We introduce a scheduling model, inspired by data ow computers, in which the overhead incurred in a system as well as computation time are described explicitly. Using this model, we provide algorithms for partitioning programs so as to minimize their completion time. In the traditional data ow paradigm, every instruction is considered a \task", and it is scheduled for execution as early as poss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 80 شماره
صفحات -
تاریخ انتشار 1998